MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
نویسندگان
چکیده
منابع مشابه
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the fir...
متن کاملTabu Search for Multiobjective Optimization: MOTS
This paper presents the multiobjective tabu search method, MOTS. Being an adaptation of the well known tabu search, it is used heuristically to generate non-dominated alternatives to multiobjective combinatorial optimization problems. MOTS works with a set of current solutions which, through manipulation of weights, are optimized towards the nondominated frontier while at the same time seek to ...
متن کاملA Comparison of Diverse Approaches to Memetic Multiobjective Combinatorial Optimization
Memetic algorithms (MAs) are, at present, amongst the most successful approximate methods for combinatorial optimization. Recently , their range of application in this domain has been extended, with the introduction of several MAs for problems possessing multiple objectives. In this paper, we consider two of the newest of these MAs, the random directions multiple objective genetic local searche...
متن کاملM-PAES: A Memetic Algorithm for Multiobjective Optimization
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, c...
متن کاملA Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of move...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2008
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2008003